recursive ascent造句

例句与造句

1. It can also yield some minimal performance improvements over conventional recursive ascent.
2. Intuitively, recursive ascent is a literal implementation of the automaton state.
3. Recursive ascent was first described by Thomas Penello in his article in 1986.
4. A recursive ascent parser implements an LALR parser using mutually-recursive functions rather than tables.
5. Recursive ascent has also been merged with recursive descent, yielding a technique known as recursive ascent / descent.
6. It's difficult to find recursive ascent in a sentence. 用recursive ascent造句挺难的
7. Recursive ascent has also been merged with recursive descent, yielding a technique known as recursive ascent / descent.
8. So recursive ascent parsers are generally slower, less obvious, and harder to hand-modify than recursive descent parsers.
9. In the recursive ascent parser variation, the explicit parse stack structure is also replaced by the implicit stack used by subroutine calls.
10. It is also ( in principle ) possible to hand edit a recursive ascent parser, whereas a tabular implementation is nigh unreadable to the average human.
11. Recursive ascent is also capable of handling grammars which are LALR ( 1 ) in much the same way that table-driven parsers handle such cases ( by pre-computing conflict resolutions based on possible lookahead ).
12. Recursive ascent was first described by Thomas Pennello in his article " Very fast LR parsing " in 1986 . in 1988 as well as in an article by Leermakers, Augusteijn, Kruseman Aretz in 1992 in the journal " Theoretical Computer Science ".